Transition Logic Revisited

A new version of transition logic is presented. It integrates (dynamic) transitions, which change world states, and classical (static) reasoning, restricted in the paper to Horn logic with negation and constraints. This is achieved by de ning a deductive relationship `(T; ) among formulas for a partially order set (T; ) of transitions. This novel integration provides a uni ed framework for practical reasoning with the potential of a full exploitation of the maturing techniques from classical planning and deduction. For the chosen formula type the logic at the same time o ers one possible clari cation of the deductive formalism envisioned for original STRIPS but never made precise before.